| 1. | Minimum spanning tree algorithm based on extended double list storage structure
基于扩展双链式存储结构的最小生成树算法 |
| 2. | Minimum spanning tree
最小代价生成树 |
| 3. | An algorithm for finding minimum spanning trees and comparison with other algorithm
求最小生成树的另一算法及其与其它算法的比较 |
| 4. | Minimum spanning tree
最小生成树 |
| 5. | The application and analyze about the algorithm of minimum spanning tree in multi - join
最小生成树算法在多元连接中的应用及算法分析 |
| 6. | On the models of graph theory based on minimum spanning tree with applications in medicine
基于最小生成树的图论模型及其在医学中的应用 |
| 7. | A new algorithm based on the minimum spanning tree theory of graph was proposed which improved the computation efficiency and reliability of previous methods . 2
对基于图的最小生成树理论的算法进行了改进，新算法在效率和可靠性方面都有所提高； 2 |
| 8. | The algorithm starts with generating a minimum spanning tree to find basic route , and then select , an adjustable unit to modify and determine the final routes
该算法从构造最小生成树开始，找出基本线路；然后通过选择可调单元调整线路得到优化的线路。 |
| 9. | At first , various existing dynamic multicast routing algorithms with no constraint is compared . a dynamic multicast algorithm dpg ( dynamic prim - based greedy multicast algorithm ) which is based on minimum span tree is presented
在比较了典型的动态无约束费用优化多播路由算法后，提出了基于最小生成树的动态贪婪算法? ?一dpg算法。 |
| 10. | For solving the problem of finding the degree - constrained minimum spanning tree ( dcmst ) in network design and optimization , a heuristic search method is proposed , in which based on minimum spanning tree , degrees of vertices over the constrained degrees are reduced to the required state
摘要针对网络设计和优化中度约束最小生成树问题，提出了一种基于贪心思想的启发式算法求解度约束最小生成树。 |
